Prime Number Theorem

The prime number theorem may refer to any one of many different results estimating the prime counting function $\pi$. Here we present the most commonly stated version, and one of the weaker versions.

This claim is simply that the relative error between $\pi (x)$ and $\frac{x}{\log x}$ tends to $0$. This makes no claim about the absolute error $\pi (x)-\frac{x}{\log x}$, for which better results exist, as well as better approximating functions.

The prime number theorem, as proven here, is merely a consequence of a closely related result for the second Chebyshev function. As such, the main work involved in proving the theorem comes from that that theorem. Here we just show that they are equivalent.

Proof

From this result we have

For a lower bound, we have for any $ϵ\in (0,1)$

noting that $\log x=O(x^{1-ϵ})$.

Combining these and dividing by $x$ gives the inequality

It is then clear by the pinching theorem that the prime number theorem implies $\psi (x)\sim x$ because $\underset{x\to \mathrm{\infty }}{lim}O(x^{-ϵ})=0$.

For the reverse implication, we can derive from the above inequality

and again the result follows from the pinching theorem.

Proof

First note that we have by direct comparison that

and thus $\mathrm{Li}(x)\to \mathrm{\infty }$ as $x\to \mathrm{\infty }$.

Hence by L'Hopital's Rule and the fundamental theorem of calculus we have